Graph Theoretic Models for Reasoning About Time

نویسنده

  • Martin Charles Golumbic
چکیده

Reasoning about time is a very ancient discipline, perhaps as old as prehistoric man. These ancient humans had discovered how long to roast their hunted meat and how to dry and age the skins of animals. They learned how and when to plant seeds, and where guided by the cycles of the sun, moon and the seasons. Our ancestors knew that day followed night and night followed day, and they had some notion of duration of day and night. This basic temporal knowledge was exploited to develop a sense of planning, taking advantage of observation and experience. For example, they would have observed that deer drink at the river at a certain time of the day, or that fish are easier to catch in the early morning. Early humans could recognize the changing seasons, and adapted their behavior in order to expect and avoid some of the dangers of cold and hunger by preparing in advance. If we start our solar-earth stopwatch at 100-200 thousand years ago, and follow it through to the beginning of recorded history, we will see the evolution of human understanding of time. Reasoning about time is an integral component of every advance of mankind. The annual flooding of the Nile brought fertile soil to the river banks long before the Egyptian kingdoms existed, but the quantum leap in exploiting and controlling this natural phenomenon did not happen until the great empires had been formed. As Persia, Mesopotamia, Egypt, China and India developed writing and scholarship, the process of human knowledge and reasoning entered a new era. The seasonal planter became the seasonal shipper, and our temporal planner skipped past a thousand generations. Our current notions of reasoning about time are not very different from the ideas of the “literate elite” among those of the ancient Greeks, Hebrews, Romans, Confucians. With today’s reasoning algorithms and techniques, temporal models and logics, and advances in philosophy, cognitive science and psychology, the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in the Event Calculus

In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. ...

متن کامل

THE ORDER GRAPHS OF GROUPS

Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...

متن کامل

A Graph-Theoretic Model for Time

Time is ordinarily viewed as a path or cycle. Graph models are considered which are a maximal extension of the old ones, subject to a topological constraint. It is shown that the new models have enhanced properties for the representation of temporal phenomena and may provide a useful framework for examining some fundamental assumptions about time.

متن کامل

Exact annihilating-ideal graph of commutative rings

The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.

متن کامل

The Sum Graph of Non-essential Submodules

Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...

متن کامل

Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories

We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by partially observable stochastic games (POSGs). We provide a finite-horizon value iteration for this framework and show that it characterizes finite-horizon Nash equilibria. We also des...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004